منابع مشابه
Recurrence of Random Walk Traces
We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings. §
متن کاملRecurrence of Reinforced Random Walk On a Ladder
Consider reinforced random walk on a graph that looks like a doubly infinite ladder. All edges have initial weight 1, and the reinforcement convention is to add δ > 0 to the weight of an edge upon first crossing, with no reinforcement thereafter. This paper proves recurrence for all δ > 0. In so doing, we introduce a more general class of processes, termed multiplelevel reinforced random walks....
متن کاملAlmost Sure Recurrence of the Simple Random Walk Path
It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.
متن کاملRecurrence Theorems in Various Types of Random Walk
In 1921 George Polya famously resolved the question of recurrence versus transience of the simple random walk on integer lattices. In this talk we will study the analogous question for random basic walks, which are random processes related to the problem of graph exploration by a mobile entity. After discussing recurrence results on other generalizations of simple random walks, we’ll resolve th...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2007
ISSN: 0091-1798
DOI: 10.1214/009117906000000935